National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Sort Program for Real Keys with Linear Time Complexity
Jiřina, Marcel
In this report we present a program for sorting data structures with sorting keys as real numbers, i.e. of type "real" or "float". The basis of the program is a modification of the countingsort algorithm for reals (instead of integers). It uses a comparision-type sorting for small part of data set given. The time complexity of this part of program can be bounded by linear function of n and thus, the total time complexity is also O(n) for n data items.
Plný tet: Download fulltextPDF

Interested in being notified about new results for this query?
Subscribe to the RSS feed.